Nearest neighbor graph

Results: 37



#Item
11Expected-Case Complexity of Approximate Nearest Neighbor Searching ∗ Sunil Arya† Ho-Yam Addy Fu†

Expected-Case Complexity of Approximate Nearest Neighbor Searching ∗ Sunil Arya† Ho-Yam Addy Fu†

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-03-31 23:24:24
12A Stable Graph-Based Representation for Object Recognition through High-Order Matching A. Albarelli, F. Bergamasco, L. Rossi, S. Vascon and A. Torsello Universit`a Ca’ Foscari Venezia www.dais.unive.it Abstract

A Stable Graph-Based Representation for Object Recognition through High-Order Matching A. Albarelli, F. Bergamasco, L. Rossi, S. Vascon and A. Torsello Universit`a Ca’ Foscari Venezia www.dais.unive.it Abstract

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2015-03-30 09:03:51
13MatchMiner: Efficient Spanning Structure Mining in Large Image Collections Yin Lou Noah Snavely

MatchMiner: Efficient Spanning Structure Mining in Large Image Collections Yin Lou Noah Snavely

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2012-12-12 19:00:12
14Methods of Network Analysis  Clustering and Blockmodeling 3. Graphs and Clustering Vladimir Batagelj University of Ljubljana, Slovenia

Methods of Network Analysis Clustering and Blockmodeling 3. Graphs and Clustering Vladimir Batagelj University of Ljubljana, Slovenia

Add to Reading List

Source URL: vlado.fmf.uni-lj.si

Language: English - Date: 2002-06-11 05:49:21
15Outline 1 Problem Statement Applications Three Data Models

Outline 1 Problem Statement Applications Three Data Models

Add to Reading List

Source URL: yury.name

Language: English - Date: 2007-04-30 17:22:42
16Maximal Intersection Queries in Randomized Graph Models Benjamin Hoffmann1 Yury Lifshits2

Maximal Intersection Queries in Randomized Graph Models Benjamin Hoffmann1 Yury Lifshits2

Add to Reading List

Source URL: yury.name

Language: English - Date: 2007-09-12 16:31:08
17pp[removed]Sw72] Swonger, C.W., “Sample set condensation for a condensed nearest neighbor decision rule for pattern recognition,” in Frontiers in Pattern Recognition, Ed., S. Watanabe, Academic Press, 1972, pp. 51

pp[removed]Sw72] Swonger, C.W., “Sample set condensation for a condensed nearest neighbor decision rule for pattern recognition,” in Frontiers in Pattern Recognition, Ed., S. Watanabe, Academic Press, 1972, pp. 51

Add to Reading List

Source URL: www-cgrl.cs.mcgill.ca

Language: English - Date: 2002-06-10 15:35:29
18The triangulation is based on Delaunay method, creating the corresponding Voronoi polygons and is tested to process 1 million of points in less than 10 seconds (din referat) -> continuare Triangulation definition The mea

The triangulation is based on Delaunay method, creating the corresponding Voronoi polygons and is tested to process 1 million of points in less than 10 seconds (din referat) -> continuare Triangulation definition The mea

Add to Reading List

Source URL: www.landtm.com

Language: English - Date: 2010-09-16 08:25:59
19Superpixel Graph Label Transfer with Learned Distance Metric Stephen Gould1 , Jiecheng Zhao1 , Xuming He1,2 , and Yuhang Zhang1,3 1  Research School of Computer Science, ANU, Australia

Superpixel Graph Label Transfer with Learned Distance Metric Stephen Gould1 , Jiecheng Zhao1 , Xuming He1,2 , and Yuhang Zhang1,3 1 Research School of Computer Science, ANU, Australia

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2014-07-13 09:20:10
20Consistent Minimization of Clustering Objective Functions Ulrike von Luxburg Max Planck Institute for Biological Cybernetics  S´ebastien Bubeck

Consistent Minimization of Clustering Objective Functions Ulrike von Luxburg Max Planck Institute for Biological Cybernetics S´ebastien Bubeck

Add to Reading List

Source URL: www.princeton.edu

Language: English - Date: 2011-06-28 04:17:11